Ela Sign Patterns That Require or Allow Power - Positivity

نویسندگان

  • M. Catral
  • L. Hogben
  • D. D. Olesky
  • P. van den Driessche
چکیده

A matrix A is power-positive if some positive integer power of A is entrywise positive. A sign pattern A is shown to require power-positivity if and only if either A or −A is nonnegative and has a primitive digraph, or equivalently, either A or −A requires eventual positivity. A sign pattern A is shown to be potentially power-positive if and only if A or −A is potentially eventually positive. 1. Introduction. A matrix A ∈ R n×n is called power-positive [2, 10] if there is a positive integer k such that A k is entrywise positive (A k > 0). Note that if A is a power-positive matrix, then −A is also power-positive, because A k > 0 implies (−A) 2k > 0. If there is an odd positive integer k such that A k > 0, then A is called power-positive of odd exponent. Power-positive matrices have applications to the study of stability of competitive systems in economics; see, e.g., [7, 8, 9]. A real square matrix A is eventually positive if there exists a positive integer k 0 such that A k > 0 for all k ≥ k 0. An eventually positive matrix and its negative are both obviously power-positive.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Ela Sign Patterns That Allow Eventual Positivity

Several necessary or sufficient conditions for a sign pattern to allow eventual positivity are established. It is also shown that certain families of sign patterns do not allow eventual positivity. These results are applied to show that for n ≥ 2, the minimum number of positive entries in an n×n sign pattern that allows eventual positivity is n+1, and to classify all 2×2 and 3×3 sign patterns a...

متن کامل

Sign Patterns That Require or Allow

A matrix A is power-positive if some positive integer power of A is entrywise positive. A sign pattern A is shown to require power-positivity if and only if either A or −A is nonnegative and has a primitive digraph, or equivalently, either A or −A requires eventual positivity. A sign pattern A is shown to be potentially power-positive if and only if A or −A is potentially eventually positive.

متن کامل

Potential Eventual Positivity of One Specific Tree Sign Pattern

A sign pattern is a matrix whose entries belong to the set {+,−, 0}. An n-by-n sign pattern A is said to allow an eventually positive matrix if there exist some real matrices A with the same sign pattern as A and a positive integer k0 such that Ak > 0 for all k ≥ k0. Identifying and classifying the n-by-n sign patterns that allow an eventually positive matrix were posed as two open problems by ...

متن کامل

Ela Refined Inertias of Tree Sign Patterns

The refined inertia (n+, n−, nz, 2np) of a real matrix is the ordered 4-tuple that subdivides the number n0 of eigenvalues with zero real part in the inertia (n+, n−, n0) into those that are exactly zero (nz) and those that are nonzero (2np). For n ≥ 2, the set of refined inertias Hn = {(0, n, 0, 0), (0, n − 2, 0, 2), (2, n − 2, 0, 0)} is important for the onset of Hopf bifurcation in dynamical...

متن کامل

Sign patterns that allow eventual positivity

Several necessary or sufficient conditions for a sign pattern to allow eventual positivity are established. It is also shown that certain families of sign patterns do not allow eventual positivity. These results are applied to show that for n ≥ 2, the minimum number of positive entries in an n×n sign pattern that allows eventual positivity is n+1, and to classify all 2×2 and 3×3 sign patterns a...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010